Efficient Two-Dimensional Parallel Pattern Matching with Scaling
نویسندگان
چکیده
Given a text and a pattern, the problem of pattern matching consists of determining all the positions of the text where the pattern occurs. When the text and the pattern are matrices, the matching is termed bidimensional. There are variations of this problem where we allow the matching using a somehow modified pattern. In this paper we assume that the pattern can be scaled. We propose a new parallel algorithm for this problem, under the CGM (Coarse Grained Multicomputer) model. This algorithm requires linear local computing time in the input, linear memory and uses only one communication round, during which at most a linear amount of data is exchanged. To the best of our knowledge, there are no known parallel algorithms for the bidimensional pattern matching problem with scaling in the literature. This proposed algorithm was implemented on a parallel machine and the experimental results obtained were very promising and showed significant speedups.
منابع مشابه
Parallel Bi-dimensional Pattern Matching with Scaling
This paper deals with the problem of bi-dimensional pattern matching with scaling. The problem is to find all occurrences of the m m pattern in the N N text, scaled to all natural multiples. We have proposed an efficient parallel algorithm for this problem on CREW-PRAM with p2 processors. It takes O(N2 p2 ) time.
متن کاملUsing Human Computation in Dead-zone based 2D Pattern Matching
This paper examines the application of human computation (HC) to twodimensional image pattern matching. The two main goals of our algorithm are to use turks as the processing units to perform an efficient pattern match attempt on a subsection of an image, and to divide the work using a version of dead-zone based pattern matching. In this approach, human computation presents an alternative to ma...
متن کاملParallel Implementation of Exact Two Dimensional Pattern Matching Algorithms using MPI and OpenMP
The need for processing power is constantly increasing as more processing-demanding and time-critical applications appear. Parallel processing has emerged as an efficient and costeffective solution, since low-end workstations and multiprocessors are cheaply available in the commodity market. In this paper, experimental results are presented on the parallel processing of the Naive, Karp and Rabi...
متن کاملOptimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions
All algorithms below are optimal alphabet-independent parallel CRCW PRAM algorithms. In one dimension: Given a pattern string of length m for the string-matching problem, we design an algorithm that computes a deterministic sample of a suu-ciently long substring in constant time. This problem used to be a bottleneck in the pattern preprocessing for one-and two-dimensional pattern matching. The ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007